The type N Karlhede bound is sharp

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parameters for which the Griesmer bound is not sharp

7 We prove for a large class of parameters t and r that a multiset of at most t d−k + r d−k−2 points in PG(d, q) that blocks every k-dimensional subspace at least t times must contain a sum of t subspaces of codimension k. 9 We use our results to identify a class of parameters for linear codes for which the Griesmer bound is not sharp. Our theorem generalizes the non-existence results from Maru...

متن کامل

A Sharp Bound on the s-Energy

We derive an (essentially) optimal bound of O(1/ρs)n−1 on the s-energy of an n-agent averaging system, where ρ is a lower bound on the nonzero weights. The s-energy is a generating function with applications to opinion dynamics, synchronization, consensus, bird flocking, inhomogeneous products of stochastic matrices, etc. We discuss a few of the improvements one can derive from the new bounds.

متن کامل

A Sharp Lower Bound for the Canonical Volume of 3-folds of General Type

Let V be a smooth projective 3-fold of general type. Denote by K, a rational number, the self-intersection of the canonical sheaf of any minimal model of V . One defines K as the canonical volume of V . Assume pg(V ) ≥ 2. We show that K 3 ≥ 1 3 , which is a sharp lower bound. Then we classify those V with small volume. We also give some new examples with pg = 2 which have maximal canonical stab...

متن کامل

A Sharp Lower Bound for Mixed-membership

The goal is to estimate {πi, 1 ≤ i ≤ n} (i.e., membership estimation). We model the network with the degree-corrected mixed membership (DCMM) model [8]. Since for many natural networks, the degrees have an approximate power-law tail, we allow severe degree heterogeneity in our model. For any membership estimation {π̂i, 1 ≤ i ≤ n}, since each πi is a probability mass function, it is natural to me...

متن کامل

A sharp isoperimetric bound for convex bodies

We consider the problem of lower bounding a generalized Minkowski measure of subsets of a convex body with a log-concave probability measure, conditioned on the set size. A bound is given in terms of diameter and set size, which is sharp for all set sizes, dimensions, and norms. In the case of uniform density a stronger theorem is shown which is also sharp.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Classical and Quantum Gravity

سال: 2007

ISSN: 0264-9381,1361-6382

DOI: 10.1088/0264-9381/25/1/012001